Counting Graph Homomorphisms
نویسندگان
چکیده
3 Connection matrices 9 3.1 The connection matrix of a graph parameter . . . . . . . . . . . . . . . . . . . . 9 3.2 The rank of connection matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.3 Connection matrices of homomorphisms . . . . . . . . . . . . . . . . . . . . . . . 12 3.4 The exact rank of connection matrices for homomorphisms . . . . . . . . . . . . 13 3.5 Extensions: directed graphs, hypergraphs, semigroups . . . . . . . . . . . . . . . 14 3.6 Edge coloring models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.7 Edge colorings and homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . 16
منابع مشابه
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
We present a framework for the complexity classification of parameterized counting problems that can be formulated as the summation over the numbers of homomorphisms from small pattern graphs H1, . . . ,H` to a big host graph G with the restriction that the coefficients correspond to evaluations of the Möbius function over the lattice of a graphic matroid. This generalizes the idea of Curticape...
متن کاملThe Complexity of Counting Graph Homomorphisms Draft: 1 April 1999
The problem of counting graph homomorphisms is considered. We show that the counting problem corresponding to a given graph is #P-complete unless every connected component of the graph is an isolated vertex without a loop, a complete graph with all loops present, or a complete unlooped bipartite graph.
متن کاملHomomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from $G$ to the $3$-clique. In this setup, the structure receiving the homomorphisms is often referred to as a template; we use the term template function to refer...
متن کاملGraph homomorphisms II: some examples
In this talk we will discuss some examples of graph homomorphisms. More precisely, the graph parameters which can be represented by counting the graph homomorphisms. The main reference is Section 2 in [2].
متن کاملThe Complexity of Counting Surjective Homomorphisms and Compactions
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the vertices of H and all of the non-loop edges of H . Hell and Nešetřil gave a complete characterisation of the complexity of deciding whether there is a homomorphism ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006